Game Theoretical Insights in Strategic Patrolling: Model and Algorithm in Normal-Form
نویسنده
چکیده
In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strategically, being in competition, and their analysis is carried out by employing game theoretical tools. One of the most challenging strategic interaction situation is the strategic patrolling: a guard patrols a number of houses in the attempt to catch a rob, which, in its turn, chooses a house to rob in the attempt to be not catched by the guard. Our contribution in this paper is twofold. Firstly, we provide a critique concerning the models presented in literature and we propose a model that is game theoretical satisfactory. Secondly, by exploit the game theoretical analysis to design a solving algorithm more efficient than state-of-the-art’s ones.
منابع مشابه
Distributed Multi-Robot Area Patrolling in Adversarial Environments
Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes, but these are limited to perimeter patrolling and requir...
متن کاملComputationally Efficient Coordination in Game Trees
The solution concept of “correlated equilibrium” allows for coordination in games. For game trees with imperfect information, it gives rise to NP-hard problems, even for two-player games without chance moves. We introduce the “extensive form correlated equilibrium” (EFCE), which extends Aumann’s correlated equilibrium, where coordination is achieved by signals that are received “locally” at inf...
متن کاملA Formal Framework for Mobile Robot Patrolling in Arbitrary Environments with Adversaries
Using mobile robots for autonomous patrolling of environments to prevent intrusions is a topic of increasing practical relevance. One of the most challenging scientific issues is the problem of finding effective patrolling strategies that, at each time point, determine the next moves of the patrollers in order to maximize some objective function. In the very last years this problem has been add...
متن کاملDecentralized and Nondeterministic Multi-Robot Area Patrolling in Adversarial
Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works have proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes which only work for perimeter patrolling and require...
متن کاملDecentralized and Nondeterministic Multi-Robot Area Patrolling in Adversarial Environments
Multi-robot patrolling is the problem of repeatedly visiting a group of regions of interest in an environment with a group of robots to prevent intrusion. Early works have proposed deterministic patrolling algorithms which could be learned by an adversary observing them over time. More recent works provide non-deterministic patrolling schemes which only work for perimeter patrolling and require...
متن کامل